Axioms of adaptivity
نویسندگان
چکیده
This paper aims first at a simultaneous axiomatic presentation of the proof of optimal convergence rates for adaptive finite element methods and second at some refinements of particular questions like the avoidance of (discrete) lower bounds, inexact solvers, inhomogeneous boundary data, or the use of equivalent error estimators. Solely four axioms guarantee the optimality in terms of the error estimators. Compared to the state of the art in the temporary literature, the improvements of this article can be summarized as follows: First, a general framework is presented which covers the existing literature on optimality of adaptive schemes. The abstract analysis covers linear as well as nonlinear problems and is independent of the underlying finite element or boundary element method. Second, efficiency of the error estimator is neither needed to prove convergence nor quasi-optimal convergence behavior of the error estimator. In this paper, efficiency exclusively characterizes the approximation classes involved in terms of the best-approximation error and data resolution and so the upper bound on the optimal marking parameters does not depend on the efficiency constant. Third, some general quasi-Galerkin orthogonality is not only sufficient, but also necessary for the [Formula: see text]-linear convergence of the error estimator, which is a fundamental ingredient in the current quasi-optimality analysis due to Stevenson 2007. Finally, the general analysis allows for equivalent error estimators and inexact solvers as well as different non-homogeneous and mixed boundary conditions.
منابع مشابه
Reusability and Adaptivity of a Web-based Boolean Axioms Application
A Web-based application, called Virtual Instrument, concerning Boolean axioms, is presented in the article. The instrument can be used for self-education and for self-testing, both in three languages: Bulgarian, German and English. In the self-education mode it possesses adaptivity – the process of self-education last shorter, when the user knows more and learns quickly and last longer, if the ...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کاملBASE AXIOMS AND SUBBASE AXIOMS IN M-FUZZIFYING CONVEX SPACES
Based on a completely distributive lattice $M$, base axioms and subbase axioms are introduced in $M$-fuzzifying convex spaces. It is shown that a mapping $mathscr{B}$ (resp. $varphi$) with the base axioms (resp. subbase axioms) can induce a unique $M$-fuzzifying convex structure with $mathscr{B}$ (resp. $varphi$) as its base (resp. subbase). As applications, it is proved that bases and subbase...
متن کاملThe Urysohn, completely Hausdorff and completely regular axioms in $L$-fuzzy topological spaces
In this paper, the Urysohn, completely Hausdorff and completely regular axioms in $L$-topological spaces are generalized to $L$-fuzzy topological spaces. Each $L$-fuzzy topological space can be regarded to be Urysohn, completely Hausdorff and completely regular tosome degree. Some properties of them are investigated. The relations among them and $T_2$ in $L$-fuzzy topological spaces are discussed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره 67 شماره
صفحات -
تاریخ انتشار 2014